Dual digraphs of finite semidistributive lattices

Dual digraphs of finite join-semidistributive lattices, meet-semidistributive lattices and semidistributive are characterised. The vertices the dual maximal disjoint filter-ideal pairs lattice. approach used here combines representations arbitrary due to Urquhart (1978) Ploščica (1995). duals mainly viewed as TiRS they were presented studied in Craig--Gouveia--Haviar (2015 2022). When appropriate, Urquhart's two quasi-orders on digraph also employed. Transitive introduced their role domination theory is studied. In particular, with property that transitive form a dominating set (respectively, an in-dominating set) A characterisation both meet-and provided via minimal closure systems digraphs.